L-CBF: A Low-Power, Fast Counting Bloom Filter Architecture
نویسندگان
چکیده
منابع مشابه
The veracious counting bloom filter
Counting Bloom Filters (CBFs) are widely employed in many applications for fast membership queries. CBF works on dynamic sets rather than a static set via item insertions and deletions. CBF allows false positive, but not false negative. The Bh-Counting Bloom Filter (Bh-CBF) and Variable Increment Counting Bloom Filter (VI-CBF) are introduced to reduce the false positive probability, but they su...
متن کاملImproving counting Bloom filter performance with fingerprints
a r t i c l e i n f o a b s t r a c t Bloom filters (BFs) are used in many applications for approximate check of set membership. Counting Bloom filters (CBFs) are an extension of BFs that enable the deletion of entries at the cost of additional storage requirements. Several alternatives to CBFs can be used to reduce the storage overhead. For example schemes based on d-left hashing or Cuckoo has...
متن کاملLow Power Adder Based Auditory Filter Architecture
Cochlea devices are powered up with the help of batteries and they should possess long working life to avoid replacing of devices at regular interval of years. Hence the devices with low power consumptions are required. In cochlea devices there are numerous filters, each responsible for frequency variant signals, which helps in identifying speech signals of different audible range. In this pape...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملNew Bloom Filter Architecture For String Matching
Implementation of the Bloom filter for plagiarism detection in full text document has a problem on how to identify the same terms from different location. Location identifier can be hashed in offline mode since the collection is static. By this approach, the computation speed of the Bloom filter can be improved. Two new Bloom filter architectures are proposed in this study to overcome the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Very Large Scale Integration (VLSI) Systems
سال: 2008
ISSN: 1063-8210
DOI: 10.1109/tvlsi.2008.2000244